0.06/0.13 % Problem : SLH560^1 : TPTP v7.5.0. Released v7.5.0. 0.06/0.14 % Command : run_E %s %d THM 0.12/0.34 % Computer : n021.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.35 % CPULimit : 30 0.12/0.35 % WCLimit : 30 0.12/0.35 % DateTime : Tue Aug 9 03:07:35 EDT 2022 0.12/0.35 % CPUTime : 0.29/1.21 The problem SPC is TH0_THM_EQU_NAR 0.29/1.22 Running higher-order on 1 cores theorem proving 0.29/1.22 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.29/1.22 # Version: 3.0pre003-ho 0.30/1.38 # Preprocessing class: HSLSSMSMSSMCHFA. 0.30/1.38 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.30/1.38 # Starting full_lambda_5 with 30s (1) cores 0.30/1.38 # full_lambda_5 with pid 31494 completed with status 0 0.30/1.38 # Result found by full_lambda_5 0.30/1.38 # Preprocessing class: HSLSSMSMSSMCHFA. 0.30/1.38 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.30/1.38 # Starting full_lambda_5 with 30s (1) cores 0.30/1.38 # No SInE strategy applied 0.30/1.38 # Search class: HGHSM-FSLM32-DHFFFSBN 0.30/1.38 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.30/1.38 # Starting new_ho_10 with 17s (1) cores 0.30/1.38 # new_ho_10 with pid 31495 completed with status 0 0.30/1.38 # Result found by new_ho_10 0.30/1.38 # Preprocessing class: HSLSSMSMSSMCHFA. 0.30/1.38 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.30/1.38 # Starting full_lambda_5 with 30s (1) cores 0.30/1.38 # No SInE strategy applied 0.30/1.38 # Search class: HGHSM-FSLM32-DHFFFSBN 0.30/1.38 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.30/1.38 # Starting new_ho_10 with 17s (1) cores 0.30/1.38 # Preprocessing time : 0.007 s 0.30/1.38 # Presaturation interreduction done 0.30/1.38 0.30/1.38 # Proof found! 0.30/1.38 # SZS status Theorem 0.30/1.38 # SZS output start CNFRefutation 0.30/1.38 thf(decl_22, type, minus_1649712171iset_a: multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_23, type, plus_plus_multiset_a: multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_24, type, zero_zero_multiset_a: multiset_a). 0.30/1.38 thf(decl_25, type, nO_MAT1617603563iset_a: multiset_a > multiset_a > $o). 0.30/1.38 thf(decl_26, type, heapIm1140443833left_a: tree_a > tree_a). 0.30/1.38 thf(decl_27, type, heapIm1257206334ight_a: tree_a > tree_a). 0.30/1.38 thf(decl_28, type, heapIm1091024090Down_a: tree_a > tree_a). 0.30/1.38 thf(decl_29, type, e_a: tree_a). 0.30/1.38 thf(decl_30, type, t_a: a > tree_a > tree_a > tree_a). 0.30/1.38 thf(decl_31, type, rel_Tree_a_a: (a > a > $o) > tree_a > tree_a > $o). 0.30/1.38 thf(decl_32, type, in_tree_a: a > tree_a > $o). 0.30/1.38 thf(decl_33, type, is_heap_a: tree_a > $o). 0.30/1.38 thf(decl_34, type, multiset_a2: tree_a > multiset_a). 0.30/1.38 thf(decl_35, type, val_a: tree_a > a). 0.30/1.38 thf(decl_36, type, lattic146396397_Max_a: set_a > a). 0.30/1.38 thf(decl_37, type, add_mset_multiset_a: multiset_a > multiset_multiset_a > multiset_multiset_a). 0.30/1.38 thf(decl_38, type, add_mset_a: a > multiset_a > multiset_a). 0.30/1.38 thf(decl_39, type, comm_m315775925iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_40, type, comm_m2145643721iset_a: multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_41, type, fold_m382157835iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_42, type, fold_m364285649iset_a: (a > multiset_a > multiset_a) > multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_43, type, image_929116801iset_a: (a > multiset_a) > multiset_a > multiset_multiset_a). 0.30/1.38 thf(decl_44, type, image_mset_a_a: (a > a) > multiset_a > multiset_a). 0.30/1.38 thf(decl_45, type, mult1_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.30/1.38 thf(decl_46, type, mult_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.30/1.38 thf(decl_47, type, set_mset_multiset_a: multiset_multiset_a > set_multiset_a). 0.30/1.38 thf(decl_48, type, set_mset_a: multiset_a > set_a). 0.30/1.38 thf(decl_49, type, subseteq_mset_a: multiset_a > multiset_a > $o). 0.30/1.38 thf(decl_50, type, ord_less_eq_o_o_a: ($o > $o > a) > ($o > $o > a) > $o). 0.30/1.38 thf(decl_51, type, ord_less_eq_o_a: ($o > a) > ($o > a) > $o). 0.30/1.38 thf(decl_52, type, ord_le1530450702ee_a_o: (tree_a > tree_a > $o) > (tree_a > tree_a > $o) > $o). 0.30/1.38 thf(decl_53, type, ord_less_eq_a_a_o: (a > a > $o) > (a > a > $o) > $o). 0.30/1.38 thf(decl_54, type, ord_le1199012836iset_a: multiset_a > multiset_a > $o). 0.30/1.38 thf(decl_55, type, ord_less_eq_set_a: set_a > set_a > $o). 0.30/1.38 thf(decl_56, type, ord_less_eq_a: a > a > $o). 0.30/1.38 thf(decl_57, type, order_Greatest_o_a: (($o > a) > $o) > $o > a). 0.30/1.38 thf(decl_58, type, order_Greatest_a: (a > $o) > a). 0.30/1.38 thf(decl_59, type, order_234879434_a_o_a: (($o > a) > $o > a) > $o). 0.30/1.38 thf(decl_60, type, order_antimono_o_a_a: (($o > a) > a) > $o). 0.30/1.38 thf(decl_61, type, order_antimono_a_o_a: (a > $o > a) > $o). 0.30/1.38 thf(decl_62, type, order_antimono_a_a: (a > a) > $o). 0.30/1.38 thf(decl_63, type, produc2037245207iset_a: multiset_a > multiset_a > produc1127127335iset_a). 0.30/1.38 thf(decl_64, type, product_Pair_a_a: a > a > product_prod_a_a). 0.30/1.38 thf(decl_65, type, irrefl_a: set_Product_prod_a_a > $o). 0.30/1.38 thf(decl_66, type, trans_a: set_Product_prod_a_a > $o). 0.30/1.38 thf(decl_67, type, collect_a: (a > $o) > set_a). 0.30/1.38 thf(decl_68, type, member_multiset_a: multiset_a > set_multiset_a > $o). 0.30/1.38 thf(decl_69, type, member340150864iset_a: produc1127127335iset_a > set_Pr158363655iset_a > $o). 0.30/1.38 thf(decl_70, type, member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o). 0.30/1.38 thf(decl_71, type, member_a: a > set_a > $o). 0.30/1.38 thf(decl_72, type, l1: tree_a). 0.30/1.38 thf(decl_73, type, l2: tree_a). 0.30/1.38 thf(decl_74, type, r1: tree_a). 0.30/1.38 thf(decl_75, type, r2: tree_a). 0.30/1.38 thf(decl_76, type, t: tree_a). 0.30/1.38 thf(decl_77, type, v: a). 0.30/1.38 thf(decl_78, type, v1: a). 0.30/1.38 thf(decl_79, type, v2: a). 0.30/1.38 thf(decl_80, type, v3: a). 0.30/1.38 thf(decl_81, type, esk1_2: tree_a > a > tree_a). 0.30/1.38 thf(decl_82, type, esk2_2: tree_a > a > a). 0.30/1.38 thf(decl_83, type, esk3_2: tree_a > a > tree_a). 0.30/1.38 thf(decl_84, type, esk4_1: tree_a > a). 0.30/1.38 thf(decl_85, type, esk5_1: tree_a > a). 0.30/1.38 thf(decl_86, type, esk6_1: tree_a > a). 0.30/1.38 thf(decl_87, type, esk7_1: tree_a > tree_a). 0.30/1.38 thf(decl_88, type, esk8_1: tree_a > tree_a). 0.30/1.38 thf(decl_89, type, esk9_1: tree_a > a). 0.30/1.38 thf(decl_90, type, esk10_1: tree_a > a). 0.30/1.38 thf(decl_91, type, esk11_1: tree_a > tree_a). 0.30/1.38 thf(decl_92, type, esk12_1: tree_a > tree_a). 0.30/1.38 thf(decl_93, type, esk13_1: tree_a > a). 0.30/1.38 thf(decl_94, type, esk14_1: tree_a > a). 0.30/1.38 thf(decl_95, type, esk15_1: tree_a > tree_a). 0.30/1.38 thf(decl_96, type, esk16_1: tree_a > tree_a). 0.30/1.38 thf(decl_97, type, esk17_1: tree_a > a). 0.30/1.38 thf(decl_98, type, esk18_1: tree_a > tree_a). 0.30/1.38 thf(decl_99, type, esk19_1: tree_a > tree_a). 0.30/1.38 thf(decl_100, type, esk20_1: tree_a > a). 0.30/1.38 thf(decl_101, type, esk21_1: tree_a > a). 0.30/1.38 thf(decl_102, type, esk22_1: tree_a > a). 0.30/1.38 thf(decl_103, type, esk23_1: tree_a > tree_a). 0.30/1.38 thf(decl_104, type, esk24_1: tree_a > tree_a). 0.30/1.38 thf(decl_105, type, esk25_1: tree_a > a). 0.30/1.38 thf(decl_106, type, esk26_1: tree_a > a). 0.30/1.38 thf(decl_107, type, esk27_1: tree_a > tree_a). 0.30/1.38 thf(decl_108, type, esk28_1: tree_a > tree_a). 0.30/1.38 thf(decl_109, type, esk29_1: tree_a > a). 0.30/1.38 thf(decl_110, type, esk30_1: tree_a > a). 0.30/1.38 thf(decl_111, type, esk31_1: tree_a > tree_a). 0.30/1.38 thf(decl_112, type, esk32_1: tree_a > tree_a). 0.30/1.38 thf(decl_113, type, esk33_1: tree_a > a). 0.30/1.38 thf(decl_114, type, esk34_1: tree_a > tree_a). 0.30/1.38 thf(decl_115, type, esk35_1: tree_a > tree_a). 0.30/1.38 thf(decl_116, type, esk36_1: tree_a > a). 0.30/1.38 thf(decl_117, type, esk37_1: tree_a > tree_a). 0.30/1.38 thf(decl_118, type, esk38_1: tree_a > tree_a). 0.30/1.38 thf(decl_119, type, esk39_1: (tree_a > $o) > a). 0.30/1.38 thf(decl_120, type, esk40_1: (tree_a > $o) > tree_a). 0.30/1.38 thf(decl_121, type, esk41_1: (tree_a > $o) > tree_a). 0.30/1.38 thf(decl_122, type, epred1_2: ($o > a) > ($o > a) > $o). 0.30/1.38 thf(decl_123, type, esk42_1: (a > a > $o) > a). 0.30/1.38 thf(decl_124, type, esk43_1: (a > a > $o) > a). 0.30/1.38 thf(decl_125, type, esk44_1: (a > a > $o) > a). 0.30/1.38 thf(decl_126, type, esk45_1: (a > a > $o) > a). 0.30/1.38 thf(decl_127, type, esk46_4: a > a > (a > $o > a) > ($o > a) > a). 0.30/1.38 thf(decl_128, type, esk47_4: a > a > (a > $o > a) > ($o > a) > a). 0.30/1.38 thf(decl_129, type, esk48_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.30/1.38 thf(decl_130, type, esk49_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.30/1.38 thf(decl_131, type, esk50_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_132, type, esk51_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_133, type, esk52_4: a > a > (a > a) > a > a). 0.30/1.38 thf(decl_134, type, esk53_4: a > a > (a > a) > a > a). 0.30/1.38 thf(decl_135, type, esk54_4: ($o > a) > (a > $o > a) > a > a > a). 0.30/1.38 thf(decl_136, type, esk55_4: ($o > a) > (a > $o > a) > a > a > a). 0.30/1.38 thf(decl_137, type, esk56_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_138, type, esk57_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_139, type, esk58_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_140, type, esk59_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_141, type, esk60_4: a > (a > a) > a > a > a). 0.30/1.38 thf(decl_142, type, esk61_4: a > (a > a) > a > a > a). 0.30/1.38 thf(decl_143, type, esk62_4: a > a > (a > $o > a) > ($o > a) > a). 0.30/1.38 thf(decl_144, type, esk63_4: a > a > (a > $o > a) > ($o > a) > a). 0.30/1.38 thf(decl_145, type, esk64_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.30/1.38 thf(decl_146, type, esk65_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.30/1.38 thf(decl_147, type, esk66_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_148, type, esk67_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_149, type, esk68_4: a > a > (a > a) > a > a). 0.30/1.38 thf(decl_150, type, esk69_4: a > a > (a > a) > a > a). 0.30/1.38 thf(decl_151, type, esk70_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_152, type, esk71_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_153, type, esk72_4: ($o > a) > (a > $o > a) > a > a > a). 0.30/1.38 thf(decl_154, type, esk73_4: ($o > a) > (a > $o > a) > a > a > a). 0.30/1.38 thf(decl_155, type, esk74_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_156, type, esk75_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.30/1.38 thf(decl_157, type, esk76_4: a > (a > a) > a > a > a). 0.30/1.38 thf(decl_158, type, esk77_4: a > (a > a) > a > a > a). 0.30/1.38 thf(decl_159, type, esk78_2: (($o > a) > $o) > ($o > a) > $o > a). 0.30/1.38 thf(decl_160, type, esk79_2: (a > $o) > a > a). 0.30/1.38 thf(decl_161, type, esk80_2: (($o > a) > $o) > ($o > a) > $o > a). 0.30/1.38 thf(decl_162, type, esk81_3: (($o > a) > $o) > ($o > a) > (($o > a) > $o) > $o > a). 0.30/1.38 thf(decl_163, type, esk82_2: (a > $o) > a > a). 0.30/1.38 thf(decl_164, type, esk83_3: (a > $o) > a > (a > $o) > a). 0.30/1.38 thf(decl_165, type, esk84_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > a). 0.30/1.38 thf(decl_166, type, esk85_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.30/1.38 thf(decl_167, type, esk86_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.30/1.38 thf(decl_168, type, esk87_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > a). 0.30/1.38 thf(decl_169, type, esk88_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.30/1.38 thf(decl_170, type, esk89_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.30/1.38 thf(decl_171, type, esk90_1: (a > a > $o) > a). 0.30/1.38 thf(decl_172, type, esk91_3: (a > a > $o) > tree_a > tree_a > a). 0.30/1.38 thf(decl_173, type, esk92_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.30/1.38 thf(decl_174, type, esk93_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.30/1.38 thf(decl_175, type, esk94_3: (a > a > $o) > tree_a > tree_a > a). 0.30/1.38 thf(decl_176, type, esk95_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.30/1.38 thf(decl_177, type, esk96_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.30/1.38 thf(decl_178, type, esk97_1: (a > $o > a) > a). 0.30/1.38 thf(decl_179, type, esk98_1: (a > $o > a) > a). 0.30/1.38 thf(decl_180, type, esk99_1: (($o > a) > a) > $o > a). 0.30/1.38 thf(decl_181, type, esk100_1: (($o > a) > a) > $o > a). 0.30/1.38 thf(decl_182, type, esk101_1: (($o > a) > $o > a) > $o > a). 0.30/1.38 thf(decl_183, type, esk102_1: (($o > a) > $o > a) > $o > a). 0.30/1.38 thf(decl_184, type, esk103_1: (a > a) > a). 0.30/1.38 thf(decl_185, type, esk104_1: (a > a) > a). 0.30/1.38 thf(decl_186, type, esk105_2: a > multiset_a > multiset_a). 0.30/1.38 thf(decl_187, type, esk106_2: a > multiset_a > multiset_a). 0.30/1.38 thf(decl_188, type, esk107_4: a > multiset_a > a > multiset_a > multiset_a). 0.30/1.38 thf(decl_189, type, esk108_1: (multiset_a > $o) > a). 0.30/1.38 thf(decl_190, type, esk109_1: (multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_191, type, esk110_1: (multiset_a > $o) > a). 0.30/1.38 thf(decl_192, type, esk111_1: (multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_193, type, esk112_1: multiset_a > a). 0.30/1.38 thf(decl_194, type, esk113_1: multiset_a > multiset_a). 0.30/1.38 thf(decl_195, type, esk114_1: (multiset_a > $o) > a). 0.30/1.38 thf(decl_196, type, esk115_1: (multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_197, type, esk116_1: (multiset_a > multiset_a > $o) > a). 0.30/1.38 thf(decl_198, type, esk117_1: (multiset_a > multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_199, type, esk118_1: (multiset_a > multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_200, type, esk119_1: (multiset_a > multiset_a > $o) > a). 0.30/1.38 thf(decl_201, type, esk120_1: (multiset_a > multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_202, type, esk121_1: (multiset_a > multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_203, type, esk122_1: multiset_a > a). 0.30/1.38 thf(decl_204, type, esk123_1: multiset_a > multiset_a). 0.30/1.38 thf(decl_205, type, esk124_1: multiset_a > a). 0.30/1.38 thf(decl_206, type, esk125_3: multiset_a > multiset_a > (multiset_a > $o) > a). 0.30/1.38 thf(decl_207, type, esk126_3: multiset_a > multiset_a > (multiset_a > $o) > multiset_a). 0.30/1.38 thf(decl_208, type, esk127_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.30/1.38 thf(decl_209, type, esk128_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.30/1.38 thf(decl_210, type, esk129_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.30/1.38 thf(decl_211, type, esk130_6: multiset_a > a > multiset_a > multiset_a > multiset_a > set_Product_prod_a_a > a). 0.30/1.38 thf(decl_212, type, esk131_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.30/1.38 thf(decl_213, type, esk132_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.30/1.38 thf(decl_214, type, esk133_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.30/1.38 thf(decl_215, type, esk134_1: multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_216, type, esk135_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_217, type, esk136_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_218, type, esk137_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_219, type, esk138_4: set_Product_prod_a_a > multiset_a > multiset_a > a > a). 0.30/1.38 thf(decl_220, type, esk139_3: a > multiset_a > multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_221, type, esk140_3: multiset_a > (a > multiset_a) > (a > multiset_a) > a). 0.30/1.38 thf(decl_222, type, esk141_4: (a > a) > a > multiset_a > multiset_a > multiset_a). 0.30/1.38 thf(decl_223, type, esk142_4: (a > a) > multiset_a > a > multiset_a > multiset_a). 0.30/1.38 thf(decl_224, type, esk143_4: (a > a) > multiset_a > a > multiset_a > a). 0.30/1.38 thf(decl_225, type, esk144_1: multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_226, type, esk145_2: a > multiset_multiset_a > multiset_a). 0.30/1.38 thf(decl_227, type, epred2_1: set_a > a > $o). 0.30/1.38 thf(decl_228, type, epred3_2: ($o > a) > ($o > a) > $o). 0.30/1.38 thf(decl_229, type, epred4_2: ($o > a) > ($o > a) > $o). 0.30/1.38 thf(decl_230, type, esk146_1: (a > a) > a). 0.30/1.38 thf(decl_231, type, esk147_1: (a > a) > a). 0.30/1.38 thf(decl_232, type, esk148_1: (($o > a) > a) > $o > a). 0.30/1.38 thf(decl_233, type, esk149_1: (($o > a) > a) > $o > a). 0.30/1.38 thf(decl_234, type, esk150_1: (a > $o > a) > a). 0.30/1.38 thf(decl_235, type, esk151_1: (a > $o > a) > a). 0.30/1.38 thf(decl_236, type, esk152_1: (($o > a) > $o > a) > $o > a). 0.30/1.38 thf(decl_237, type, esk153_1: (($o > a) > $o > a) > $o > a). 0.30/1.38 thf(fact_12_siftDown_Osimps_I6_J, axiom, ![X17:a, X18:tree_a, X19:tree_a, X20:a, X21:tree_a, X22:tree_a, X1:a]:((((ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ (val_a @ (t_a @ X20 @ X21 @ X22)))=>(((ord_less_eq_a @ (val_a @ (t_a @ X20 @ X21 @ X22)) @ X1)=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19))))&(~((ord_less_eq_a @ (val_a @ (t_a @ X20 @ X21 @ X22)) @ X1))=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ (val_a @ (t_a @ X20 @ X21 @ X22)) @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X20 @ X21 @ X22)) @ (heapIm1257206334ight_a @ (t_a @ X20 @ X21 @ X22)))) @ (t_a @ X17 @ X18 @ X19))))))&(~((ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ (val_a @ (t_a @ X20 @ X21 @ X22))))=>(((ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ X1)=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19))))&(~((ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ X1))=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ (t_a @ X20 @ X21 @ X22) @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X17 @ X18 @ X19)) @ (heapIm1257206334ight_a @ (t_a @ X17 @ X18 @ X19))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_12_siftDown_Osimps_I6_J)). 0.30/1.38 thf(fact_11_val_Osimps, axiom, ![X1:a, X15:tree_a, X16:tree_a]:(((val_a @ (t_a @ X1 @ X15 @ X16))=(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_11_val_Osimps)). 0.30/1.38 thf(conj_0, conjecture, (in_tree_a @ v @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.30/1.38 thf(fact_0_False, axiom, ~((ord_less_eq_a @ v2 @ v1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_False)). 0.30/1.38 thf(fact_3__C5__1_Oprems_C, axiom, (in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3__C5__1_Oprems_C)). 0.30/1.38 thf(fact_1_True, axiom, (ord_less_eq_a @ v2 @ v3), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_True)). 0.30/1.38 thf(c_0_6, plain, ![X17:a, X18:tree_a, X19:tree_a, X20:a, X21:tree_a, X22:tree_a, X1:a]:((((ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ (val_a @ (t_a @ X20 @ X21 @ X22)))=>(((ord_less_eq_a @ (val_a @ (t_a @ X20 @ X21 @ X22)) @ X1)=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X20 @ X21 @ X22)) @ X1)=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ (val_a @ (t_a @ X20 @ X21 @ X22)) @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X20 @ X21 @ X22)) @ (heapIm1257206334ight_a @ (t_a @ X20 @ X21 @ X22)))) @ (t_a @ X17 @ X18 @ X19))))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ (val_a @ (t_a @ X20 @ X21 @ X22)))=>(((ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ X1)=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ X1)=>((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X20 @ X21 @ X22) @ (t_a @ X17 @ X18 @ X19)))=(t_a @ (val_a @ (t_a @ X17 @ X18 @ X19)) @ (t_a @ X20 @ X21 @ X22) @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X17 @ X18 @ X19)) @ (heapIm1257206334ight_a @ (t_a @ X17 @ X18 @ X19))))))))))), inference(fof_simplification,[status(thm)],[fact_12_siftDown_Osimps_I6_J])). 0.30/1.38 thf(c_0_7, plain, ![X1077:a, X1078:tree_a, X1079:tree_a, X1080:a, X1081:tree_a, X1082:tree_a, X1083:a]:((((~(ord_less_eq_a @ (val_a @ (t_a @ X1080 @ X1081 @ X1082)) @ X1083)|((heapIm1091024090Down_a @ (t_a @ X1083 @ (t_a @ X1080 @ X1081 @ X1082) @ (t_a @ X1077 @ X1078 @ X1079)))=(t_a @ X1083 @ (t_a @ X1080 @ X1081 @ X1082) @ (t_a @ X1077 @ X1078 @ X1079)))|~(ord_less_eq_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ (val_a @ (t_a @ X1080 @ X1081 @ X1082))))&((ord_less_eq_a @ (val_a @ (t_a @ X1080 @ X1081 @ X1082)) @ X1083)|((heapIm1091024090Down_a @ (t_a @ X1083 @ (t_a @ X1080 @ X1081 @ X1082) @ (t_a @ X1077 @ X1078 @ X1079)))=(t_a @ (val_a @ (t_a @ X1080 @ X1081 @ X1082)) @ (heapIm1091024090Down_a @ (t_a @ X1083 @ (heapIm1140443833left_a @ (t_a @ X1080 @ X1081 @ X1082)) @ (heapIm1257206334ight_a @ (t_a @ X1080 @ X1081 @ X1082)))) @ (t_a @ X1077 @ X1078 @ X1079)))|~(ord_less_eq_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ (val_a @ (t_a @ X1080 @ X1081 @ X1082)))))&((~(ord_less_eq_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ X1083)|((heapIm1091024090Down_a @ (t_a @ X1083 @ (t_a @ X1080 @ X1081 @ X1082) @ (t_a @ X1077 @ X1078 @ X1079)))=(t_a @ X1083 @ (t_a @ X1080 @ X1081 @ X1082) @ (t_a @ X1077 @ X1078 @ X1079)))|(ord_less_eq_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ (val_a @ (t_a @ X1080 @ X1081 @ X1082))))&((ord_less_eq_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ X1083)|((heapIm1091024090Down_a @ (t_a @ X1083 @ (t_a @ X1080 @ X1081 @ X1082) @ (t_a @ X1077 @ X1078 @ X1079)))=(t_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ (t_a @ X1080 @ X1081 @ X1082) @ (heapIm1091024090Down_a @ (t_a @ X1083 @ (heapIm1140443833left_a @ (t_a @ X1077 @ X1078 @ X1079)) @ (heapIm1257206334ight_a @ (t_a @ X1077 @ X1078 @ X1079))))))|(ord_less_eq_a @ (val_a @ (t_a @ X1077 @ X1078 @ X1079)) @ (val_a @ (t_a @ X1080 @ X1081 @ X1082))))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])). 0.30/1.38 thf(c_0_8, plain, ![X1074:a, X1075:tree_a, X1076:tree_a]:(((val_a @ (t_a @ X1074 @ X1075 @ X1076))=(X1074))), inference(variable_rename,[status(thm)],[fact_11_val_Osimps])). 0.30/1.38 thf(c_0_9, plain, ![X1:a, X2:tree_a, X3:tree_a, X7:a, X6:tree_a, X5:tree_a, X4:a]:((((heapIm1091024090Down_a @ (t_a @ X4 @ (t_a @ X7 @ X5 @ X6) @ (t_a @ X1 @ X2 @ X3)))=(t_a @ X4 @ (t_a @ X7 @ X5 @ X6) @ (t_a @ X1 @ X2 @ X3)))|(ord_less_eq_a @ (val_a @ (t_a @ X1 @ X2 @ X3)) @ (val_a @ (t_a @ X7 @ X5 @ X6)))|~((ord_less_eq_a @ (val_a @ (t_a @ X1 @ X2 @ X3)) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.30/1.38 thf(c_0_10, plain, ![X3:tree_a, X2:tree_a, X1:a]:(((val_a @ (t_a @ X1 @ X2 @ X3))=(X1))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.30/1.38 thf(c_0_11, negated_conjecture, ~(in_tree_a @ v @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.30/1.38 thf(c_0_12, plain, ~(ord_less_eq_a @ v2 @ v1), inference(fof_simplification,[status(thm)],[fact_0_False])). 0.30/1.38 thf(c_0_13, plain, (in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), inference(split_conjunct,[status(thm)],[fact_3__C5__1_Oprems_C])). 0.30/1.38 thf(c_0_14, plain, ![X2:tree_a, X5:tree_a, X4:a, X3:tree_a, X7:a, X6:tree_a, X1:a]:((((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X4 @ X2 @ X3) @ (t_a @ X7 @ X5 @ X6)))=(t_a @ X1 @ (t_a @ X4 @ X2 @ X3) @ (t_a @ X7 @ X5 @ X6)))|(ord_less_eq_a @ X7 @ X4)|~((ord_less_eq_a @ X7 @ X1)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10]), c_0_10]), c_0_10])). 0.30/1.38 thf(c_0_15, plain, (ord_less_eq_a @ v2 @ v3), inference(split_conjunct,[status(thm)],[fact_1_True])). 0.30/1.38 thf(c_0_16, negated_conjecture, ~((in_tree_a @ v @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.30/1.38 thf(c_0_17, plain, ~((ord_less_eq_a @ v2 @ v1)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.30/1.38 thf(c_0_18, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])]), c_0_16]), c_0_17]), ['proof']). 0.30/1.38 # SZS output end CNFRefutation 0.30/1.38 # Parsed axioms : 262 0.30/1.38 # Removed by relevancy pruning/SinE : 0 0.30/1.38 # Initial clauses : 476 0.30/1.38 # Removed in clause preprocessing : 84 0.30/1.38 # Initial clauses in saturation : 392 0.30/1.38 # Processed clauses : 907 0.30/1.38 # ...of these trivial : 16 0.30/1.38 # ...subsumed : 187 0.30/1.38 # ...remaining for further processing : 704 0.30/1.38 # Other redundant clauses eliminated : 185 0.30/1.38 # Clauses deleted for lack of memory : 0 0.30/1.38 # Backward-subsumed : 7 0.30/1.38 # Backward-rewritten : 2 0.30/1.38 # Generated clauses : 2000 0.30/1.38 # ...of the previous two non-redundant : 1663 0.30/1.38 # ...aggressively subsumed : 0 0.30/1.38 # Contextual simplify-reflections : 0 0.30/1.38 # Paramodulations : 1706 0.30/1.38 # Factorizations : 4 0.30/1.38 # NegExts : 0 0.30/1.38 # Equation resolutions : 192 0.30/1.38 # Propositional unsat checks : 0 0.30/1.38 # Propositional check models : 0 0.30/1.38 # Propositional check unsatisfiable : 0 0.30/1.38 # Propositional clauses : 0 0.30/1.38 # Propositional clauses after purity: 0 0.30/1.38 # Propositional unsat core size : 0 0.30/1.38 # Propositional preprocessing time : 0.000 0.30/1.38 # Propositional encoding time : 0.000 0.30/1.38 # Propositional solver time : 0.000 0.30/1.38 # Success case prop preproc time : 0.000 0.30/1.38 # Success case prop encoding time : 0.000 0.30/1.38 # Success case prop solver time : 0.000 0.30/1.38 # Current number of processed clauses : 369 0.30/1.38 # Positive orientable unit clauses : 72 0.30/1.38 # Positive unorientable unit clauses: 1 0.30/1.38 # Negative unit clauses : 31 0.30/1.38 # Non-unit-clauses : 265 0.30/1.38 # Current number of unprocessed clauses: 1410 0.30/1.38 # ...number of literals in the above : 4505 0.30/1.38 # Current number of archived formulas : 0 0.30/1.38 # Current number of archived clauses : 301 0.30/1.38 # Clause-clause subsumption calls (NU) : 18776 0.30/1.38 # Rec. Clause-clause subsumption calls : 12298 0.30/1.38 # Non-unit clause-clause subsumptions : 166 0.30/1.38 # Unit Clause-clause subsumption calls : 771 0.30/1.38 # Rewrite failures with RHS unbound : 0 0.30/1.38 # BW rewrite match attempts : 61 0.30/1.38 # BW rewrite match successes : 2 0.30/1.38 # Condensation attempts : 907 0.30/1.38 # Condensation successes : 14 0.30/1.38 # Termbank termtop insertions : 68685 0.30/1.38 0.30/1.38 # ------------------------------------------------- 0.30/1.38 # User time : 0.131 s 0.30/1.38 # System time : 0.014 s 0.30/1.38 # Total time : 0.145 s 0.30/1.38 # Maximum resident set size: 4000 pages 0.30/1.38 0.30/1.38 # ------------------------------------------------- 0.30/1.38 # User time : 0.139 s 0.30/1.38 # System time : 0.018 s 0.30/1.38 # Total time : 0.157 s 0.30/1.38 # Maximum resident set size: 2240 pages 0.30/1.38 EOF